Estimation of tumor heterogeneity using CGH array data
نویسندگان
چکیده
منابع مشابه
Analysis of Array CGH Data for the Estimation of Genetic Tumor Progression
Analysis of ArrayCGH Data for the Estimation of Genetic Tumor Progression Laura Toloşi Master of Science Department of Computer Science Saarland University 2006 In cancer research, prediction of time to death or relapse is important for a meaningful tumor classification and selecting appropriate therapies. The accumulation of genetic alterations during tumor progression can be used for the asse...
متن کاملP-243: Prenatal Diagnosis Using Array CGH: Case Presentation
Background: Karyotype analysis has been the standard and reliable procedure for prenatal cytogenetic diagnosis since the 1970s. However, the major limitation remains requirement for cell culture, resulting in a delay of as much as 14 days to get the test results.CGH array technology has proven to be useful in detecting causative genomic imbalances or genetic mutations in as many as 15% of child...
متن کاملSmoothing waves in array CGH tumor profiles
MOTIVATION Many high-resolution array comparative genomic hybridization tumor profiles contain a wave bias, which makes accurate detection of breakpoints in such profiles more difficult. RESULTS An efficient and highly effective algorithm that largely removes the wave bias from tumor profiles by regressing the tumor profile data on data of profiles from the clinical genetics practice. Results...
متن کاملCGH-Explorer: a program for analysis of array-CGH data
SUMMARY CGH-Explorer is a program for visualization and statistical analysis of microarray-based comparative genomic hybridization (array-CGH) data. The program has preprocessing facilities, tools for graphical exploration of individual arrays or groups of arrays, and tools for statistical identification of regions of amplification and deletion.
متن کاملQuantile smoothing of array CGH data
MOTIVATION Plots of array Comparative Genomic Hybridization (CGH) data often show special patterns: stretches of constant level (copy number) with sharp jumps between them. There can also be much noise. Classic smoothing algorithms do not work well, because they introduce too much rounding. To remedy this, we introduce a fast and effective smoothing algorithm based on penalized quantile regress...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Bioinformatics
سال: 2009
ISSN: 1471-2105
DOI: 10.1186/1471-2105-10-12